An exponential time 2-approximation algorithm for bandwidth
نویسندگان
چکیده
منابع مشابه
An Exponential Time 2-Approximation Algorithm for Bandwidth
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b. In this paper, we present a 2-approximation algorithm for the Bandwidth problem that takes worstcase O(1.9797n) = O(30.6217n) time and uses polynomial space. This improves both the previous best 2and 3-appro...
متن کاملAn Exponential Approximation Algorithm in Linear Programming
The algorithm determines a non-iteration procedure for computing the optimal solution of a linear programming problem. We consider approximating system of linear equations to determine the optimal basis variables of the linear programming problem. The usefulness of the algorithm is illustrated by a numerical example. © 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under...
متن کاملAn Approximation Algorithm for the Bandwidth Problem on Dense Graphs
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum di erence between two numbers of adjacent vertices is minimal The problem is known to be NP complete Pa and there are only few algorithms for rather special cases of the problem HMM Kr Sa Sm In this paper we present a randomized approximation algorithm for the bandwidth problem restricted to ...
متن کاملAn exact exponential time algorithm for counting bipartite cliques
We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491), improving upon known exact algorithms for finding and counting bipartite cliques.
متن کاملA Cubic-Time 2-Approximation Algorithm for rSPR Distance
Due to hybridization events in evolution, studying two different genes of a set of species may yield two related but different phylogenetic trees for the set of species. In this case, we want to measure the dissimilarity of the two trees. The rooted subtree prune and regraft (rSPR) distance of the two trees has been used for this purpose. The problem of computing the rSPR distance of two given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.03.024